1371D - Grid-00100 - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
//for math u can observe something related to gcd or something related to even or odd to draw some conclusions
//if your answer is lieing in a range then binary search is the best approach to solve that problem
//for errors check out of bound and overflow of integers
//sorting,binary search,dynamic programming,greedy are some of the most used techniques to solve the problems
//until some element it is good and then next it is bad u should use binary search
//to find the first good element or to find the first bad element we use binary search\
//if there are digits then remember that the digits are just from 0-9 so u can use two loops the same for character a-z they are just 26

int main() {
	// your code goes here
	int t;
	cin>>t;
	while(t--)
	{
	  int n,k;
	  cin>>n>>k;
	  int p=k/n;
	  int r=k%n;
	  int a[n][n];

	  for(int i=0;i<n;i++)
	  {
	      for(int j=0;j<n;j++)
	      {
	          a[i][j]=0;
	      }
	  }
	  for(int i=0;i<n;i++)
	  {
	      int e=p;
	      if(r>0) e+=1;
	      for(int j=i;j<i+n;j++)
	      {
	        if(e>0)
            {
                a[i][j%n]=1;
                e--;
            }
	      }
	      r--;
	  }
	  int maxir=0;
	  int minir=n;
	  int maxic=0;
	  int minic=n;
	  int sum=0;
	  for(int i=0;i<n;i++)
	  {
	      sum=0;
	      for(int j=0;j<n;j++)
	      {
	         if(a[i][j]==1) sum++;
	      }
	      maxir=max(maxir,sum);
	      minir=min(minir,sum);
	  }
	  for(int i=0;i<n;i++)
	  {
	      sum=0;
	      for(int j=0;j<n;j++)
	      {
	         if(a[j][i]==1) sum++;
	      }
	      maxic=max(maxic,sum);
	      minic=min(minic,sum);
	  }
	  cout<<((maxir-minir)*(maxir-minir))+((maxic-minic)*(maxic-minic))<<endl;
	  for(int i=0;i<n;i++)
	  {
	      for(int j=0;j<n;j++)
	      {
	          cout<<a[i][j];
	      }
	      cout<<endl;
	  }

	}


	return 0;
}